An optimization based domain decomposition method for PDEs with random inputs

نویسندگان

  • Jangwoon Lee
  • Jeehyun Lee
  • Yoongu Hwang
چکیده

Jangwoon Lee* ([email protected]), University of Mary Washington, Department of Mathematics, 1301 College Ave, Fredericksburg, VA 22401, and Jeehyun Lee and Yoongu Hwang. An Optimization Based Domain Decomposition Method for PDEs with Random Inputs. An optimization-based domain decomposition method for stochastic elliptic partial differential equations is presented. The main idea of the method is a constrained optimization problem for which the minimization of an appropriate functional forces the solutions on the two subdomains to agree on the interface; the constraints are the stochastic partial differential equations. The existence of optimal solutions for the stochastic optimal control problem is shown as is the convergence to the exact solution of the given problem. We prove the existence of a Lagrange multiplier and derive an optimality system from which solutions of the domain decomposition problem may be determined. Finite element approximations to the solutions of the optimality system are defined and analyzed with respect to both spatial and random parameter spaces. Then, the results of some numerical experiments are given to confirm theoretical error estimate results. (Received September 10, 2013)

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Updating finite element model using frequency domain decomposition method and bees algorithm

The following study deals with the updating the finite element model of structures using the operational modal analysis. The updating process uses an evolutionary optimization algorithm, namely bees algorithm which applies instinctive behavior of honeybees for finding food sources. To determine the uncertain updated parameters such as geometry and material properties of the structure, local and...

متن کامل

Additive Operator Decomposition and Optimization-Based Reconnection with Applications

We develop an optimization-based approach for additive decomposition and reconnection of algebraic problems arising from discretization of partial differential equations (PDEs). Application to a scalar advection-diffusion PDE illustrates the new approach. In particular, we obtain a robust iterative solver for advection-dominated problems using standard multi-level solvers for the Poisson equation.

متن کامل

Feature Selection in Structural Health Monitoring Big Data Using a Meta-Heuristic Optimization Algorithm

This paper focuses on the processing of structural health monitoring (SHM) big data. Extracted features of a  structure are reduced using an optimization algorithm to find a minimal subset of salient features by removing noisy, irrelevant and redundant data. The PSO-Harmony algorithm is introduced for feature selection to enhance the capability of the proposed method for processing the  measure...

متن کامل

Algorithms for Propagating Uncertainty Across Heterogeneous Domains

We address an important research area in stochastic multi-scale modeling, namely the propagation of uncertainty across heterogeneous domains characterized by partially correlated processes with vastly different correlation lengths. This class of problems arise very often when computing stochastic PDEs and particle models with stochastic/stochastic domain interaction but also with stochastic/det...

متن کامل

Symbolic Techniques for Domain Decomposition Methods

Some algorithmic aspects of systems of PDEs based simulations can be better clarified by means of symbolic computation techniques. This is very important since numerical simulations heavily rely on solving systems of PDEs. For the large-scale problems we deal with in today’s standard applications, it is necessary to rely on iterative Krylov methods that are scalable (i.e., weakly dependent on t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computers & Mathematics with Applications

دوره 68  شماره 

صفحات  -

تاریخ انتشار 2014